Sweeping with Continuous Domains
نویسندگان
چکیده
The geost constraint has been proposed to model and solve discrete placement problems involving multi-dimensional boxes (packing in space and time). The filtering technique is based on a sweeping algorithm that requires the ability for each constraint to compute a forbidden box around a given fixed point and within a surrounding area. Several cases have been studied so far, including integer linear inequalities. Motivated by the placement of objects with curved shapes, this paper shows how to implement this service for continuous constraints with arbitrary mathematical expressions. The approach relies on symbolic processing and defines a new interval arithmetic.
منابع مشابه
Kernel-Based Models for Reinforcement Learning
Model-based approaches to reinforcement learning exhibit low sample complexity while learning nearly optimal policies, but they are generally restricted to finite domains. Meanwhile, function approximation addresses continuous state spaces but typically weakens convergence guarantees. In this work, we develop a new algorithm that combines the strengths of Kernel-Based Reinforcement Learning, wh...
متن کاملFast Two-scale Methods for Eikonal Equations
Fast Marching and Fast Sweeping are the two most commonly used methods for solving the Eikonal equation. Each of these methods performs best on a different set of problems. Fast Sweeping, for example, will outperform Fast Marching on problems where the characteristics are largely straight lines. Fast Marching, on the other hand, is usually more efficient than Fast Sweeping on problems where cha...
متن کاملFourth International Conference on Autonomous Agents and Multi Agent Systems Workshop on Learning and Adaptation in Multi Agent Systems
TBA Peter Stone Computer Science Department, University of Texas at Austin, USA Multi-Robot Learning for Continuous Area Sweeping Tasks Abstract: Asmobile robots become increasingly autonomous over extended periods of time, opportunities arise for their use on repetitive tasks. We define and implement behaviors for a class of such tasks that we call continuous area sweeping tasks. A continuous ...
متن کاملSweeping by a tame process
We show that any semi-algebraic sweeping process admits piecewise absolutely continuous solutions, and any such bounded trajectory must have finite length. Analogous results hold more generally for sweeping processes definable in o-minimal structures. This extends previous work on (sub)gradient dynamical systems beyond monotone sweeping sets.
متن کاملPolygon-to-Function Conversion for Sweeping
This paper describes an approach to the representation of polygons by real functions and its application to sweeping. We combine an algorithm employing a monotone function of a boolean operation, with R-functions. Application of this method results in a continuous function F(x,y) with zero value at polygon edges. We discuss and illustrate different sweeping techniques with the use of functional...
متن کامل